Solving degree, last fall degree, and related invariants

نویسندگان

چکیده

In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides rigorous framework for estimating complexity system equations via Gröbner bases methods. Our main results include connection between last fall one regularity Castelnuovo–Mumford regularity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP

Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic assumptions. In this paper we introduce the noti...

متن کامل

Splice Graphs and their Vertex-Degree-Based Invariants

Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

splice graphs and their vertex-degree-based invariants

let g_1 and g_2 be simple connected graphs with disjoint vertex sets v(g_1) and v(g_2), respectively. for given vertices a_1in v(g_1) and a_2in v(g_2), a splice of g_1 and g_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the :union: of g_1 and g_2. in this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.

متن کامل

On the last fall degree of zero-dimensional Weil descent systems

In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gröbner basis computations and the heuristic first fall degree assumption and is not based on any heuristic. This method relies on the new concept of last fall degree. Let k be a finite field of cardinality qn and let k be its subfield of cardinality q. Let ...

متن کامل

On Global Degree Bounds for Invariants

Let G be a linear algebraic group over a field K of characteristic 0. An integer m is called a global degree bound for G if for every linear representation V the invariant ring K[V ] is generated by invariants of degree at most m. We prove that if G has a global degree bound, then G must be finite. The converse is well known from Noether’s degree bound.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2023

ISSN: ['1095-855X', '0747-7171']

DOI: https://doi.org/10.1016/j.jsc.2022.05.001